Compactness results in extremal graph theory
نویسندگان
چکیده
منابع مشابه
Compactness results in extremal graph theory
Below we shall consider only graphs without loops and multiple edges . For a graph G, let e (G), v (G), and X (G) denote the number of edges, vertices and the chromatic number, respectively . The first upper index always denotes the number of vertices, e.g ., T",11, G", S" are graphs of order n . C, P, and Kt denote the cycle, path and complete graph of t vertices . The degree of x in G" is dG ...
متن کاملSome new results in extremal graph theory
In recent years several classical results in extremal graph theory have been improved in a uniform way and their proofs have been simpli ed and streamlined. These results include a new Erd1⁄2os-Stone-Bollobás theorem, several stability theorems, several saturation results and bounds for the number of graphs with large forbidden subgraphs. Another recent trend is the expansion of spectral extrem...
متن کاملResults in Extremal Graph and Hypergraph Theory
In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or minima of certain functions and identifying the points of optimality. We consider a variety of functions on graphs and hypegraphs and determine the structures that optimize them. A central problem in extremal (hyper)graph theory is that of finding the maximum number of edges in a (hyper)graph tha...
متن کاملExtremal Graph Theory
3 Third Lecture 11 3.1 Applications of the Zarankiewicz Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 The Turán Problem for Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.3 The Girth Problem and Moore’s Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.4 Application of Moore’s Bound to Graph Spanners . . . . . . . . . . . ....
متن کاملExtremal infinite graph theory
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1982
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02579234